pARMS: A Package for the Parallel Iterative Solution of General Large Sparse Linear System ∗ User’s Guide
نویسندگان
چکیده
For many large-scale applications, solving large sparse linear systems is the most time-consuming part. The important criteria for a suitable solver include efficiency, robustness, and good parallel performance. The Parallel Algebraic Recursive Multilevel Solver (pARMS) [8] is a suite of distributed-memory iterative accelerators and preconditioners targeting the solution of general sparse linear systems. It adopts a general framework of distributed sparse matrices and relies on the solution of the resulting distributed Schur complement systems. This version of pARMS was reimplemented. The new version has the follow features:
منابع مشابه
pARMS: A Package for Solving General Sparse Linear Systems on Parallel Computers
This paper presents an overview of pARMS, a package for solving sparse linear systems on parallel platforms. Preconditioners constitute the most important ingredient in the solution of linear systems arising from realistic scientific and engineering applications. The most common parallel preconditioners used for sparse linear systems adapt domain decomposition concepts to the more general frame...
متن کاملPreconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation
Introduction Fractional differential equations (FDEs) have attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme may be a good approach, particularly, the schemes in numerical linear algebra for solving ...
متن کاملA numerical experimental study of inverse preconditioning for the parallel iterative solution to 3D finite element flow equations
Integration of the subsurface flow equation by finite elements (FE) in space and finite differences (FD) in time requires the repeated solution to sparse symmetric positive definite systems of linear equations. Iterative techniques based on preconditioned conjugate gradients (PCG) are one of the most attractive tool to solve the problem on sequential computers.A present challenge is to make PCG...
متن کاملSolving Irregular Sparse Linear Systems On a Multicomputer Using the Cgnr Method
The eecient solution of irregular sparse linear systems on a distributed memory parallel computer is still a major challenge. Direct methods are concerned with unbalanced load processing or data distribution as well as diiculties pertaining to reuse eecient sequential codes. Iterative methods of the Krylov family are well suited for parallel computing but can provide disappointing convergence f...
متن کاملThe Efficient Parallel Iterative Solution of Large Sparse Linear Systems
The development of eecient, general-purpose software for the iterative solution of sparse linear systems on a parallel MIMD computer requires an interesting combination of expertise. Parallel graph heuristics, convergence analysis, and basic linear algebra implementation issues must all be considered. In this paper, we discuss how we have incorporated recent results in these areas into a genera...
متن کامل